Ordered biclique partitions and communication complexity problems
نویسندگان
چکیده
منابع مشابه
Ordered Biclique Partitions and Communication Complexity Problems
An ordered biclique partition of the complete graph Kn on n vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of Kn is covered by at least one and at most two bicliques in the collection, and (ii) if an edge e is covered by two bicliques then each endpoint of e is in the first class in one of these bicliques and in the second class in other one. In...
متن کاملBiclique Covers and Partitions
The biclique cover number (resp. biclique partition number) of a graph G, bc(G) (resp. bp(G)), is the least number of bicliques—complete bipartite subgraphs—that are needed to cover (resp. partition) the edges of G. The local biclique cover number (resp. local biclique partition number) of a graph G, lbc(G) (resp. lbp(G)), is the least r such that there is a cover (resp. partition) of the edges...
متن کاملFractional Biclique Covers and Partitions of Graphs
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc∗(G), and the fractional biclique partition number, bp∗(G), of a graph G. It is observed that bc∗(G) and bp∗(G) provide lower bounds on the biclique cover and partition numbers respectively, and conditions for equality are given. It is also shown that bc∗(G) is a better lower ...
متن کاملBiclique-colouring verification complexity and biclique-colouring power graphs
Biclique-colouring is a colouring of the vertices of a graph in such a way that no maximal complete bipartite subgraph with at least one edge is monochromatic. We show that it is coNP-complete to check whether a given function that associates a colour to each vertex is a bicliquecolouring, a result that justifies the search for structured classes where the biclique-colouring problem could be ef...
متن کاملApproximating Clique and Biclique Problems
We present here 2-approximation algorithms for several node deletion and edge deletion biclique problems and for an edge deletion clique problem. The biclique problem is to find a node induced subgraph that is bipartite and complete. The objective is to minimize the total weight of nodes or edges deleted so that the remaining subgraph is bipartite complete. Several variants of the biclique prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.10.029